A Representation Theorem for Generic Line Arrangements in the Plane

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topology of Generic Line Arrangements

Our aim is to generalize the result that two generic complex line arrangements are equivalent. In fact for a line arrangement A we associate its defining polynomial f = ∏ i(aix + biy + ci), so that A = (f = 0). We prove that the defining polynomials of two generic line arrangements are, up to a small deformation, topologically equivalent. In higher dimension the related result is that within a ...

متن کامل

Straight Line Arrangements in the Real Projective Plane

Let A be an arrangement of n pseudolines in the real projective plane and let p 3 (A) be the number of triangles of A. Grünbaum has proposed the following question. Are there infinitely many simple arrangements of straight lines with p 3 (A) = 1 3 n(n − 1)? In this paper we answer this question affirmatively.

متن کامل

Crossing edges and faces of line arrangements in the plane

For any natural number n we define f(n) to be the minimum number with the following property. Given any arrangement A(L) of n blue lines in the real projective plane one can find f(n) red lines different from the blue lines such that any edge in the arrangement A(L) is crossed by a red line. We define h(n) to be the minimum number with the following property. Given any arrangement A(L) of n blu...

متن کامل

The complexity of the envelope of line and plane arrangements

A facet of an hyperplane arrangement is called external if it belongs to exactly one bounded cell. The set of all external facets forms the envelope of the arrangement. The number of external facets of a simple arrangement defined by n hyperplanes in dimension d is hypothesized to be at least d ` n−2 d−1 ́ . In this note we show that, for simple arrangements of 4 lines or more, the minimum numbe...

متن کامل

Line and Plane Arrangements with Large Average Diameter

Let ∆A(n, d) denote the largest possible average diameter of a bounded cell of a simple arrangement defined by n hyperplanes in dimension d. We have ∆A(n, 2) ≤ 2+ 2 n−1 in the plane, and ∆A(n, 3) ≤ 3+ 4 n−1 in dimension 3. In general, the average diameter of a bounded cell of a simple arrangement is conjectured to be less than the dimension; that is, ∆A(n, d) ≤ d. We propose line and plane arra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of the Indian Mathematical Society

سال: 2020

ISSN: 2455-6475,0019-5839

DOI: 10.18311/jims/2020/24873